package BSQX_Bit;

import java.util.Scanner;

public class BSQX_4_19 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNextDouble()){
            double max =0;
            double a = in.nextDouble();
            if (a > max)max=a;
            double b = in.nextDouble();
            if (b > max)max=b;
            double c = in.nextDouble();
            if (c > max)max=c;
            if (a == max && a-c >= b){
                System.out.println("No");
            }else if (b == max && b-c >= a){
                System.out.println("No");
            }else if (c == max && c-b >= a){
                System.out.println("No");
            }else {
                System.out.println("Yes");
            }
        }
    }
    public static boolean Fun( double a,  double b , double c){

        if (a + b <= c)return false;
        if (a + c <= b)return false;
        if (b + c <= a)return false;
        return true;
    }
    public static void main1(String[] args) {

        System.out.println(Add(3,5));
    }
    public static int Add(int num1,int num2) {
        //好像写过
        int sum=num1;
        int k=0;
        while (num2 != 0){
         sum = num1 ^ num2;
         k = (num1 & num2) << 1;
         num1 = sum;
         num2 = k;

        }
        return sum;
    }
}
